Lexicalized Grammar 101
نویسنده
چکیده
I propose a tree-rewriting grammar formalism, TAGLET, defined by the usual complementation operation and the simplest imaginable modification operation. TAGLET is context free and permits lexicalization of treebank parses (though TAGLET is only weakly equivalent in generative power to general CFGs), as well as straightforward exploration of rich hierarchical syntactic structures and detailed feature structures in the spirit of current linguistic syntax. It admits a dynamic-programming parser, with the N×N×N chart search characteristic of CFGs and a clean “strong competence” implementation of combinatory operations. Derivations are lexicalized dependency structures: this invites the assignment of probabilities to structures based on bigram dependencies, and at the same time introduces the natural search space for natural language generation. In short, the formalism offers a simple and effective scaffold to bring the issues of current research into classroom learning. Lexicalized Grammar 101
منابع مشابه
Lexicalized Grammar Acquisition
This paper presents a formalization of automatic grammar acquisition that is based on lexicalized grammar formalisms (e.g. LTAG and HPSG). We state the conditions for the consistent acquisition of a unique lexicalized grammar from an annotated corpus.
متن کاملLexicalization and Grammar Development Lexicalization and Grammar Development
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a representative of the class of lexicalized grammars. We illustrate the advantages of lexicalized grammars in various contexts of natural language processing,...
متن کاملLexicalization and Grammar Development
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a representative of the class of lexicalized grammars. We illustrate the advantages of lexicalized grammars in various contexts of natural language processing,...
متن کاملEncoding Frequency Information in Lexicalized Grammars
We address the issue of how to associate frequency information with lexicalized grammar formalisms, using Lexicalized Tree Adjoining Grammar as a representative framework. We consider systematically a number of alternative probabilistic frameworks, evaluating their adequacy from both a theoretical and empirical perspective using data from existing large treebanks. We also propose three orthogon...
متن کامل